Integer and Rational Exponents
نویسنده
چکیده
The terminology and notation used in this paper are introduced in the following papers: [12], [15], [4], [10], [1], [2], [3], [9], [7], [8], [14], [11], [13], [6], and [5]. For simplicity we follow the rules: a, b, c will be real numbers, m, n will be natural numbers, k, l, i will be integers, p, q will be rational numbers, and s1, s2 will be sequences of real numbers. The following propositions are true: (2)2 If s1 is convergent and for every n holds s1(n) ≥ a, then lim s1 ≥ a. (3) If s1 is convergent and for every n holds s1(n) ≤ a, then lim s1 ≤ a. Let us consider a. The functor (a)κ∈ yielding a sequence of real numbers is defined as follows: (Def.1) ((a)κ∈ )(0) = 1 and for every m holds ((a )κ∈ )(m+1) = ((a )κ∈ )(m)· a.
منابع مشابه
Two Families of Algorithms for Symbolic Polynomials
We consider multivariate polynomials with exponents that are themselves integer-valued multivariate polynomials, and we present algorithms to compute their GCD and factorization. The algorithms fall into two families: algebraic extension methods and projection methods. The first family of algorithms uses the algebraic independence of x, x, x 2 , x, etc, to solve related problems with more indet...
متن کاملInterpolation of Sparse Rational Functions Without Knowing Bounds on Exponents
We present the first algorithm for the (black box) interpolation of t-sparse, n-variate rational functions without knowing bounds on exponents of their sparse representation with the number of queries independent on exponents. In fact, the algorithm uses O(ntt) queries to the black box, and can be implemented for a fixed t in a polynomially bounded storage (or polynomial parallel time). natural...
متن کاملA Tutorial on Rational Generating Functions
Many of the positive results in this paper are derived from results from the literature on rational generating functions and in particular from the method of Barvinok and Woods [2]. Generating functions have been applied in an analogous fashion in a variety of other contexts, including social choice theory [7], discrete optimization [6], combinatorics [4], and compiler optimization [8]. We here...
متن کاملThe Characteristic Sequence and P -orderings of the Set of D-th Powers of Integers
If E is a subset of Z then the n-th characteristic ideal of the algebra of rational polynomials taking integer values on E, Int(E, Z), is the fractional ideal consisting of 0 and the leading coefficients of elements of Int(E, Z) of degree no more than n. For p a prime the characteristic sequence of Int(E, Z) is the sequence of negatives of the p-adic values of these ideals. We give recursive fo...
متن کاملComputation of invariants of finite abelian groups
We investigate the computation and applications of rational invariants of the linear action of a finite abelian group in the non-modular case. By diagonalization, such a group action can be described by integer matrices of orders and exponents. We make use of integer linear algebra to compute a minimal generating set of invariants along with the substitution needed to rewrite any invariant in t...
متن کاملNew vulnerabilities in RSA
Let N = pq be the product of two large unknown primes of equal bit-size. Wiener’s famous attack on RSA shows that using a public key (N, e) satisfying ed− k(N + 1− (p+ q)) = 1 with d < 1 3 N makes RSA completely insecure. The number of such weak keys can be estimated as N 1 4−ε. In this paper, we present a generalization of Wiener’s attack. We study two new classes of exponents satisfying an eq...
متن کامل